Comparison of Distance Models on K-Nearest Neighbor Algorithm in Stroke Disease Detection

نویسندگان

چکیده

Stroke is a cardiovascular (CVD) disease caused by the failure of brain cells to get oxygen supply pose risk ischemic damage and result in death. This Disease can detect based on similarity symptoms experienced sufferer so that early steps be taking with appropriate counseling treatment. detecting requires machine learning method. In this research, author used one supervised classification methods, namely K-Nearest Neighbor (K-NN). K-NN method calculating distance training data. research compares Euclidean, Minkowski, Manhattan, Chebyshev models obtain optimal results. The have been tested using stroke dataset sourced from Kaggle repository. Based test results, model has highest levels accuracy compared other three an average value 95.49%, 96.03%, at K = 10. Euclidean Minkowski same level each 95.45%, 95.93% Meanwhile, Manhattan lowest models, which 95.42% but 96.03% 6

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Drought Monitoring and Prediction using K-Nearest Neighbor Algorithm

Drought is a climate phenomenon which might occur in any climate condition and all regions on the earth. Effective drought management depends on the application of appropriate drought indices. Drought indices are variables which are used to detect and characterize drought conditions. In this study, it was tried to predict drought occurrence, based on the standard precipitation index (SPI), usin...

متن کامل

Weighted K-Nearest Neighbor Classification Algorithm Based on Genetic Algorithm

K-Nearest Neighbor (KNN) is one of the most popular algorithms for data classification. Many researchers have found that the KNN algorithm accomplishes very good performance in their experiments on different datasets. The traditional KNN text classification algorithm has limitations: calculation complexity, the performance is solely dependent on the training set, and so on. To overcome these li...

متن کامل

An Improved K-Nearest Neighbor with Crow Search Algorithm for Feature Selection in Text Documents Classification

The Internet provides easy access to a kind of library resources. However, classification of documents from a large amount of data is still an issue and demands time and energy to find certain documents. Classification of similar documents in specific classes of data can reduce the time for searching the required data, particularly text documents. This is further facilitated by using Artificial...

متن کامل

Shortest path distance in random k-nearest neighbor graphs

Consider a weighted or unweighted k-nearest neighbor graph that has been built on n data points drawn randomly according to some density p on R. We study the convergence of the shortest path distance in such graphs as the sample size tends to infinity. We prove that for unweighted kNN graphs, this distance converges to an unpleasant distance function on the underlying space whose properties are...

متن کامل

Distance-Constraint k-Nearest Neighbor Searching in Mobile Sensor Networks

The κ-Nearest Neighbors ( κNN) query is an important spatial query in mobile sensor networks. In this work we extend κNN to include a distance constraint, calling it a l-distant κ-nearest-neighbors (l-κNN) query, which finds the κ sensor nodes nearest to a query point that are also at or greater distance from each other. The query results indicate the objects nearest to the area of interest tha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Technology and Computing Science Journal

سال: 2021

ISSN: ['2621-4474', '2621-4458']

DOI: https://doi.org/10.33086/atcsj.v4i1.2097